Set constructors, finite sets, and logical semantics
نویسندگان
چکیده
منابع مشابه
Set-Oriented Logical Connectives: Syntax and Semantics
Of the common commutative binary logical connectives, only and and ormay be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevant, that is, as connectives that take sets of arguments. This is especially evident in the Common Logic Interchange Format, in which it is easy for operators to be given arbitrary numbers of arguments. The reason is that...
متن کاملInitial semantics in logics with constructors
The constructor-based logics constitute the logical foundation of the so-called OTS/CafeOBJ method, a modeling, specification and verification method of the observational transition systems. It is well known the important role played in algebraic specifications by the initial algebras semantics. Free models along presentation morphisms provide semantics for the modules with initial denotation i...
متن کاملSemantics of Typed Lambda-Calculus with Constructors
Gödel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two disciplines. Following a previous work [3], we consider an extension of the original ludics with contraction and universal nondeterminism, which play dual roles,...
متن کاملSingle-set and class-of-sets semantics for geometric models
Two major approaches to defining the semantics of inaccurate boundary representations have been proposed in the literature. They are referred to here as single-set semantics, and class-of-sets semantics, respectively. Our description of the distinction between these two approaches focuses on the nature of the topological regularity on which they are based (classical regularity vs. ǫ-regularity)...
متن کاملSemantics of Fuzzy Sets in Rough Set Theory
The objective of this chapter is to provide a semantic framework for fuzzy sets in the theory of rough sets. Rough membership functions are viewed as a special type of fuzzy membership functions interpretable using conditional probabilities. The relationships between fuzzy membership functions and rough membership functions, between core and support of fuzzy set theory and lower and upper appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1999
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(98)10012-2